3.0 KB · ⇊ 2 parts · ⤓ Micron 3.0 KB · ⤓ HTML 17.0 KB

layout: Wide · Narrow · Centered

top

An algorithmic paradigm or algorithm design paradigm is a generic model or framework which underlies the design of a class of algorithms. An algorithmic paradigm is an abstraction higher than the notion of an algorithm, just as an algorithm is an abstraction higher than a computer program.cite-ref-1[1]cite-ref-2[2]

• List of well-known paradigms

• General

• Parameterized complexity

• Computational geometry

• References

• Backtracking

• Branch and bound

• Brute-force search

• Divide and conquer

• Dynamic programming

• Greedy algorithm

• Recursion

• Prune and search

• Kernelization

• Iterative compression

• Sweep line algorithms

• Rotating calipers

• Randomized incremental construction

cite-note-11. ↑ p. 702

cite-note-22. ↑ p. 9